A Simulated Annealing Algorithm based on Parallel Cluster for Engineering Layout Design

The layout design problem is a kind of nesting problems that is naturally NP-hard and very difficult to solve. Layout designing of machine is even more difficult because of its nesting items are actually machine parts that have both irregular shapes and complex constraints. A feasible way to solve machine layout problem is to employ ameliorative algorithms, such as simulated annealing algorithm. But these kinds of algorithms are usually CPU-time thirsty, sometime the computing time is unbearable. In this paper, the authors advocate to parallel the simulated annealing algorithm on a multi-computer network (a parallel cluster). We have combined Message Passing Interface (MPI) with Visual C++ to integrate Simulated Annealing Algorithm based on Parallel Cluster and Engineering Layout Design Support System. An engineering example about vehicle dynamical cabin layout design is presented to test validity of the Algorithm. If appropriate temperature piece is chosen and seemly a number of nodes are used, the integration of Simulated Annealing Algorithm based on Parallel Cluster and Engineering Layout Design Support System definitely will improve the efficiency for engineer.